Computing second‐order scattering of obtuse dihedral for any incident angle

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

non-obtuse dihedral angles

Given a combinatorial description C of a polyhedron having E edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize C is generally not a convex subset of R [9]. If C has five or more faces, Andreev’s Theorem states that the corresponding space of dihedral angles AC obtained by restricting to non-obtuse angles is a convex polytope. In this paper we explain why Andre...

متن کامل

Compact hyperbolic tetrahedra with non-obtuse dihedral angles

Given a combinatorial description C of a polyhedron having E edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize C is generally not a convex subset of R [9]. If C has five or more faces, Andreev’s Theorem states that the corresponding space of dihedral angles AC obtained by restricting to non-obtuse angles is a convex polytope. In this paper we explain why Andre...

متن کامل

Angle-monotone Paths in Non-obtuse Triangulations

We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path— an xy-monotone path in an appropriately rotated coordinate system. We show that this result cannot be extended to angle-monotone spanning trees, but can be extended to boundary-rooted spanning forests. The latter leads to a conjectural...

متن کامل

Computing Acute and Non-obtuse Triangulations

We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a triangulation of the domain such that all angles are less than (or less than or equal to) π/2. This leads to the first software to compute such triangulations.

متن کامل

Evaluation of Protein Dihedral Angle Prediction Methods

Tertiary structure prediction of a protein from its amino acid sequence is one of the major challenges in the field of bioinformatics. Hierarchical approach is one of the persuasive techniques used for predicting protein tertiary structure, especially in the absence of homologous protein structures. In hierarchical approach, intermediate states are predicted like secondary structure, dihedral a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Engineering

سال: 2019

ISSN: 2051-3305,2051-3305

DOI: 10.1049/joe.2019.0164